public class HashBuck2 <K,V>{
    static class Node<K,V>{
        public K key;
        public V val;
        public Node<K,V> next;

        public Node(K key, V val) {
            this.key = key;
            this.val = val;
        }
    }

    //负载因子
    public static final float LOAD_FACTOR = 0.75F;

    public int usedSize;

    public Node<K,V>[] array;

    public HashBuck2() {
        array = (Node<K, V>[])new Node[10];
    }

    public void push(K key,V val) {
        int hash = key.hashCode();
        int index = hash % array.length;

        Node<K,V> cur = array[index];
        while (cur != null) {
            if (cur.key.equals(key)) {
                cur.val = val;
            }
            cur = cur.next;
        }

        //头插法插入
        Node<K,V> newNode = new Node<K,V>(key, val);
        newNode.next = array[index];
        array[index] = newNode;

        usedSize++;
    }

    public V get(K key) {
        int hash = key.hashCode();
        int index = hash % array.length;

        Node<K,V> cur = array[index];
        while (cur != null) {
            if (cur.key.equals(key)) {
                return cur.val;
            }
            cur = cur.next;
        }

        return null;
    }

}
